IDENTITIES FOR THE NUMBER OF STANDARD YOUNG TABLEAUX IN SOME (k, l)-HOOKS
نویسنده
چکیده
Closed formulas are known for S(k, 0; n), the number of standard Young tableaux of size n and with at most k parts, where 1 ≤ k ≤ 5. Here we study the analogous problem for S(k, ℓ; n), the number of standard Young tableaux of size n which are contained in the (k, ℓ)-hook. We deduce some formulas for the cases k + ℓ ≤ 4.
منابع مشابه
Pattern Avoidance and Young Tableaux
Motivated by [13, Theorem 4.1], this paper extends Lewis’s bijection to a bijection between a more general class L(n, k, I) of permutations and the set of standard Young tableaux of shape 〈(k + 1)n〉, so the cardinality |L(n, k, I)| = f 〈(k+1)n〉, is independent of the choice of I ⊆ [n]. As a consequence, we obtain some new combinatorial realizations and identities on Catalan numbers. In the end,...
متن کاملPii: 0097-3165(90)90066-6
We introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. These correspondences provide combinatorial proofs of various identities involving f&,, the number of standard skew tableaux of shape L/p, and the skew Schur functions So..,,. For example, we are able to show bijectively that and 4 S;&)QdY)=C ~p;p(x)~~,p(Y) n (1-%Y,)Y. P 1. I It is then shown that these ne...
متن کاملRandom Young Tableaux
We derive new combinatorial identities which may be viewed as multivariate analogs of summation formulas for hypergeometric series. As in the previous paper Re], we start with probability distributions on the space of the innnite Young tableaux. Then we calculate the probability that the entry of a random tableau at a given box equals n = 1; 2; : : :. Summing these probabilities over n and equa...
متن کاملThe Hook Formula
The hook-length formula is a well known result expressing the number of standard tableaux of shape λ in terms of the lengths of the hooks in the diagram of λ. Many proofs of this fact have been given, of varying complexity. We present here a new simple proof which will be accessible to anyone familiar with some standard power series expansions. This proof is of interest to combinatorialists for...
متن کاملGenerating Functions for Inverted Semistandard Young Tableaux and Generalized Ballot Numbers
An inverted semistandard Young tableau is a row-standard tableau along with a collection of inversion pairs that quantify how far the tableau is from being column semistandard. Such a tableau with precisely k inversion pairs is said to be a k-inverted semistandard Young tableau. Building upon earlier work by Fresse and the author, this paper develops generating functions for the numbers of kinv...
متن کامل